home *** CD-ROM | disk | FTP | other *** search
/ MacHack 1997 / MacHack 1997.toast / Hacks / Hacks ’97 / Warrior’s Progress / source code / Source / Libraries / Views / Standard Arrangements / PaneRowBase.cp < prev    next >
Encoding:
Text File  |  1997-06-28  |  2.8 KB  |  142 lines  |  [TEXT/CWIE]
  1. // PaneRowBase.cp
  2.  
  3. #ifndef PaneRowBase_h
  4. #include "PaneRowBase.h"
  5. #endif
  6. #ifndef MinMax_h
  7. #include "MinMax.h"
  8. #endif
  9. #ifndef ArrangementLoop_h
  10. #include "ArrangementLoop.h"
  11. #endif
  12. #ifndef ConstArrangementLoop_h
  13. #include "ConstArrangementLoop.h"
  14. #endif
  15.  
  16. void PaneRowBase::Arrange( Rectangle bounds )
  17.   {
  18.     uint16 minimum = MinimumWidth();
  19.     uint16 width = bounds.Width();
  20.     
  21.     uint16 slop = ( width > minimum )
  22.                       ? width - minimum
  23.                       : 0;
  24.     
  25.     uint16 sloppySlop = ( slop > 0 )
  26.                               ? width - BestWidth( width )
  27.                               : 0;
  28.     
  29.     int16 leftSide = bounds.left;
  30.     
  31.     for ( ArrangementLoop pane( *this ); pane.Unfinished(); pane++ )
  32.       {
  33.         uint16 paneMinimum = (*pane)->MinimumWidth();
  34.         
  35.         uint16 paneWidth = ( slop > 0 )
  36.                                  ? (*pane)->BestWidth( paneMinimum + slop )
  37.                                  : Min( width, paneMinimum );
  38.         
  39.         if ( sloppySlop > 0 )
  40.           {
  41.             paneWidth += sloppySlop;
  42.             sloppySlop = 0;
  43.           }
  44.  
  45.         Assert( paneWidth <= width );
  46.         width -= paneWidth;
  47.         if ( paneWidth > paneMinimum )
  48.             slop -= paneWidth - paneMinimum;
  49.         
  50.         Rectangle paneArea( leftSide,
  51.                                   bounds.top,
  52.                                   leftSide + paneWidth,
  53.                                   bounds.bottom );
  54.         Assert( bounds >= paneArea );
  55.         
  56.         pane->SetBounds( paneArea );
  57.         leftSide = paneArea.right;
  58.       }
  59.   }
  60.  
  61. uint16 PaneRowBase::MinimumWidth() const
  62.   {
  63.     return Total( &Sizeable::MinimumWidth );
  64.   }
  65.  
  66. uint16 PaneRowBase::MinimumHeight() const
  67.   {
  68.     return Maximum( &Sizeable::MinimumHeight );
  69.   }
  70.  
  71. uint16 PaneRowBase::MaximumWidth() const
  72.   {
  73.     return Total( &Sizeable::MaximumWidth );
  74.   }
  75.  
  76. uint16 PaneRowBase::MaximumHeight() const
  77.   {
  78.     return Minimum( &Sizeable::MaximumHeight );
  79.   }
  80.  
  81. uint16 PaneRowBase::ReasonableWidth() const
  82.   {
  83.     return Total( &Sizeable::ReasonableWidth );
  84.   }
  85.  
  86. uint16 PaneRowBase::ReasonableHeight() const
  87.   {
  88.     return Maximum( &Sizeable::ReasonableHeight );
  89.   }
  90.  
  91. uint16 PaneRowBase::BestWidth() const
  92.   {
  93.     return Total( &Sizeable::BestWidth );
  94.   }
  95.  
  96. uint16 PaneRowBase::BestWidth( uint16 bound ) const
  97.   {
  98.     uint16 minimum = MinimumWidth();
  99.     
  100.     if ( bound <= minimum )
  101.         return bound;
  102.  
  103.     uint16 slop = bound - minimum;
  104.     
  105.     uint16 width = 0;
  106.     for ( ConstArrangementLoop pane( *this ); pane.Unfinished(); pane++ )
  107.       {
  108.         uint16 paneMinimum = (*pane)->MinimumWidth();
  109.         uint16 paneWidth = (*pane)->BestWidth( paneMinimum + slop );
  110.         
  111.         Assert( paneWidth >= paneMinimum );
  112.         
  113.         if ( !CanAdd( width, paneWidth ) )
  114.             return maxuint16;
  115.  
  116.         width += paneWidth;
  117.         slop -= paneWidth - paneMinimum;
  118.       }
  119.     
  120.     Assert( width <= bound );
  121.     return width;
  122.   }
  123.  
  124. uint16 PaneRowBase::BestHeight() const
  125.   {
  126.     return Maximum( &Sizeable::BestHeight );
  127.   }
  128.  
  129. uint16 PaneRowBase::BestHeight( uint16 bound ) const
  130.   {
  131.     uint16 best = 0;
  132.     
  133.     for ( ConstArrangementLoop pane( *this ); pane.Unfinished(); pane++ )
  134.       {
  135.         uint16 height = (*pane)->BestHeight( bound );
  136.         if ( height > best )
  137.             best = height;
  138.       }
  139.     
  140.     return best;
  141.   }
  142.